Counting Prime Divisors on Elliptic Curves and Multiplication in Finite Fields
نویسنده
چکیده
Let K=Fq be an elliptic function eld. For every natural number n we determine the number of prime divisors of degree n of K=Fq which lie in a given divisor class of K.
منابع مشابه
Applications of elliptic curves in public key cryptography
The most popular public key cryptosystems are based on the problem of factorization of large integers and discrete logarithm problem in finite groups, in particular in the multiplicative group of finite field and the group of points on elliptic curve over finite field. Elliptic curves are of special interest since they at present alow much shorter keys, for the same level of security, compared ...
متن کاملGenerating Elliptic Curves over Finite Fields Part I: Generating by Complex Multiplication
We study the theory of rational points on elliptic curves over nite elds and the theory of complex multiplication through which we construct elliptic curves over F p such that their orders of the group of rational points over F p are of the form mr where r is a prime and m is a small integer.
متن کاملOn certain sequences in Mordell–Weil type groups
In this paper we investigate divisibility properties of two families of sequences in the Mordell–Weil group of elliptic curves over number fields without complex multiplication. We also consider more general groups of Mordell–Weil type. M. Ward ([W], Theorem 1.) proved that a linear integral recurring sequence of order two which is not nontrivially degenerate has an infinite number of distinct ...
متن کاملTorsion Points on Elliptic Curves with Complex Multiplication
i.e., the supremum of all orders of torsion points on elliptic curves defined over some degree d number field. Write T (d)′ for the set of prime divisors of elements of Td, and P (d) for the largest element of T (d)′. Let TCM(d) (resp. TIM(d)) be the subset of T (d) corresponding to elliptic curves with complex multiplication (resp. with algebraic integral modulus j(E)), and similarly adding th...
متن کاملEfficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation
In the current work we propose two efficient formulas for computing the 5-fold (5P ) of an elliptic curve point P . One formula is for curves over finite fields of even characteristic and the other is for curves over prime fields. Double base number systems (DBNS) have been gainfully exploited to compute scalar multiplication efficiently in ECC. Using the proposed point quintupling formulas one...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007